Pulse compression processor

ABSTRACT

A pulse compression processor  20  compressing a modulated pulse signal correlately received by a receiver, includes a coefficient calculator  30  calculating a set of filtering coefficients for converting sampled output signal values outside a vicinity of main-lobe of a compressed pulse signal into zero as well as for minimizing S/N loss in a peak value of the main-lobe, and a pulse compression filter  40  compressing the modulated pulse signal based on the set of the filtering coefficients calculated by the coefficient calculator.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates to pulse compression processors used for receivers of radars, and more specifically, to techniques for realizing pulse compression of the received signals with sidelobe-free as well as minimum S/N loss.

2. Description of the Related Art

A radar signal processor adopting a pulse compression method used for radars is shown in Japanese Patent Application Laid-Open H04-357485. This radar signal processor which transmits chirp signals (linear FM modulated signals) as transmission signals to relatively moving targets detects the targets from the Doppler frequency components extracted from the signals reflected by the targets.

This pulse compression method is used for converting chirp signals received by a receiver into short pulse signals by pulse compression filters matching these chirp signals. Therefore, since the method has some advantages such as longer distance detection, higher range resolution, and interference signal suppression, it is applied to many radar systems.

Such a conventional radar, called chirp radar, generally has performances evaluated by the shape of the compressed pulse signal, in particular, the width of a main-lobe (main-lobe width) and the level of sidelobe (sidelobe level), and the amount of S/N loss in the peak value of main-lobe.

As is well known, in general, main-lobe width is preferable to be narrow because of the increase of radar resolution. Further, a sidelobe level that indicates pseudo targets such as ghost echoes and clutters is preferable to be low. Of course, although S/N loss that deteriorates radar sensitivity is clearly preferable to small, the increase of the transmitted power in order to keep radar sensitivity is generally very expensive.

In the process of pulse compression, the signals received by a receiver are usually weighted by window functions to suppress the sidelobe level of the received signals (see Section 4.6.3 in the text entitled “Radar Handbook”, 2^(nd) Edition, written by M. I. Skolnik, published by McGraw-Hill, Inc. (1990)). Typical window functions have properties shown in Table 10.8 in the text quoted above. However, the suppression of sidelobe level increases S/N loss because main-lobe width becomes broadened. This leads us to the finding of the complementary relationship between main-lobe width and sidelobe level. Thus, when designing radar systems, we are forced on the trade-off between them.

There are other methods for suppressing sidelobe level as follows: first, constructing inverse filters that minimize mean squared errors from the expectation shape of the correlation output of the compressed pulse signals with desired sidelobe level; secondly, subordinately connecting sidelobe eliminating filters to pulse compression filters, and thirdly, subtracting correlation output with one sample shifts from the correlation output of the compressed pulse signals. However, since these methods aim at only sidelobe suppression, they do not assure the minimization of S/N loss because they consider the S/N loss calculated after the filter design finished.

Additionally, the following techniques are already known: first, in binary phase code modulating method, minimizing S/N loss with allowable maximum peak sidelobe level; and secondly, in the same method, minimizing peak sidelobe level with desired S/N loss. In these techniques, the method of steepest descent is used for obtaining an optimum solution of S/N loss or peak sidelobe level. However, it is hard to converge them with optimum solutions because computational efforts increase with the increase of the length of input code sequences, which are complex numbers, in the method of steepest descent.

SUMMARY OF THE INVENTION

To address the issues described above, this invention provides high-performance pulse compression processors for realizing sidelobe-free as well as high resolution and sensitivity, that is, realizing zero sidelobe level with minimum S/N loss.

According to main aspect of the present invention, there is provided a pulse compression processor compressing a modulated pulse signal correlately received by a receiver, comprising: a coefficient calculator calculating a set of filtering coefficients for converting sampled output signal values outside a vicinity of main-lobe of a compressed pulse signal into zero as well as for minimizing S/N loss in a peak value of the main-lobe; a pulse compression filter compressing the modulated pulse signal based on the set of the filtering coefficients calculated by the coefficient calculator.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a functional block diagram showing a radar signal processor adopting a pulse compression processor according to the first embodiment of the present invention.

FIG. 2A is a graph showing chirp signals modulated by a transmission signal generator and transmitted to a pulse compression processor according to the first and second embodiments of the present invention, and FIG. 2B is a graph showing a pulse shape compressed by a pulse compression processor according to the first and second embodiments of the present invention.

FIG. 3 is a functional block diagram showing a pulse compression processor according to the first embodiment of the present invention.

FIG. 4 is a functional block diagram showing a construction of a FIR filter used as a pulse compression filter of a pulse compression processor according to the first embodiment of the present invention.

FIG. 5A is a functional block diagram showing the first example of a pulse compression processor according to the second embodiment of the present invention, and FIG. 5B is a functional block diagram showing the second example of a pulse compression processor according to the second embodiment of the present invention.

FIG. 6 is a graph showing a simulation of pulse compression executed by a pulse compression processor according to the first and second embodiments of the present invention.

FIG. 7 is an enlarged graph showing a simulation of pulse compression executed by a pulse compression processor according to the first and second embodiments of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Hereinafter, we shall provide detailed explanations of pulse compression processors according to the first and second embodiments of the present invention with reference to the drawings.

First, let us explain the schematic construction of a radar signal processor adopted with a pulse compression processor according to the first and second embodiments of the present invention with reference to FIG. 1.

As shown in FIG. 1, this radar signal processor of the present invention comprises a transmission signal generator 10, a D/A converter 11, a local oscillator 12, a transmission side mixer 13, a transmission signal amplifier 14, a circulator 15, an antenna 16, a reception signal amplifier 17, a reception side mixer 18, an A/D converter 19, a pulse compression processor 20, a Discrete Fourier Transformation (DFT) processor 21, and a target detection processor 22.

The transmission signal generator 10 generates a transmitting signal, with a Pulse Repetition Frequency (PRF), that consists of the time series of a long pulse with wide frequency bandwidth broadened by modulation processing. This transmission signal is called chirp signal. For instance, FIG. 2A shows chirp signals with a pulse width T (>>τ) and a frequency bandwidth Δf (=1/τ).

The D/A converter 11 converts the chirp signal transmitted from the transmitting signal generator 10 into an analog signal.

The local oscillator 12 generates a local signal (synchronization signal) with a local frequency.

The transmission side mixer 13 transforms the analog signal transmitted from the D/A converter 11 into a high frequency signal by mixing the analog signal with the local signal transmitted from the local oscillator 12.

The transmission signal amplifier 14 amplifies the high frequency signal transmitted from the transmission side mixer 13 until reaching desired level.

The circulator 15 switches outputting the amplified high frequency signal transmitted from the transmission signal amplifier 14 to the antenna 16 and outputting a reflected signal received by the antenna 16 to the reception signal amplifier 17.

The antenna 16, which is composed of, for instance, an array antenna, transmits the high frequency signal transmitted from the transmission signal amplifier 14 via the circulator 15 to a relatively moving target as well as receives the signal reflected by the target.

The reception signal amplifier 17 amplifies the reception signal (reflection signal) transmitted from the antenna 16 via the circulator 15 with low noise.

The reception side mixer 18 mixes the amplified signal transmitted from the reception signal amplifier 17 with the local signal transmitted from the local oscillator 12, resulting in converting the amplified signal into an intermediate frequency signal, called IF signal.

The A/D converter 19 converts the IF signal transmitted from the reception side mixer 18 into an orthogonal digital signal, called I/Q signals.

The pulse compression processor 20, which corresponds to the pulse compression processor of the present invention, compresses the I/Q signal transmitted from the A/D converter 19. As will hereinafter be described in detail, this pulse compressing method is a technique for converting the long pulse signal modulated by the transmission signal generator 10 as transmitted into a short pulse signal by executing correlation processing in a range (distance) direction as received. FIG. 2B shows an example of a pulse shape compressed by this technique.

The DFT processor 21 transforms time domain data of the compressed I/Q signal transmitted from the pulse compression processor 20 into frequency domain data by calculating the Fourier transformation of the compressed I/Q signal. In other words, the DFT processor 21 decomposes the frequency domain data into Doppler frequency components that are the velocity components of the target.

The target detection processor 22 detects the target from the Doppler frequency components extracted from the frequency domain data transmitted from the DFT processor 21.

<First Embodiment>

Let us provide detailed explanations of a pulse compression processor according to the first embodiment of the present invention with reference to FIG. 3.

As shown in FIG. 3, the pulse compression processor 20 comprises a filtering coefficient calculator 30 and a pulse compression filter 40. Further, the filtering coefficient calculator 30 includes a minimum S/N loss calculator 31 and a zero sidelobe calculator 32.

The filtering coefficient calculator 30 calculates a first coefficient vector {right arrow over (H)}_(dz) provided to the pulse compression filter 40. Namely, the minimum S/N loss calculator 31 calculates second coefficient data that theoretically minimizes S/N loss, and the zero sidelobe calculator 32 calculates first coefficient data as the first coefficient vector {right arrow over (H)}_(dz) for reducing sidelobe level to zero, called sidelobe free, based on the second coefficient data as a second coefficient vector {right arrow over (H)}_(zM) calculated by the minimum S/N loss calculator 31.

The pulse compression filter 40 comprises, for example, a Finite Impulse Response (FIR) filter having the well known structure including delay elements (D), multipliers (x), and accumulators (+) as shown in FIG. 4. The pulse compression processor 40 compresses the I/Q signal transmitted from the A/D converter 19, based on the first coefficient vector {right arrow over (H)}_(dz) transmitted from the filtering coefficient calculator 30.

Next, let us explain the calculation process of the first coefficient vector {right arrow over (H)}_(dz) in the filtering coefficient calculator 30, in particular, the derivation of a pulse compression condition for satisfying the sidelobe free, called sidelobe free condition.

[Principle of Pulse Compression Processing]

In the pulse compression processor 20, the time series of the input chirp signal (the I/Q signal) inputted from the A/D converter 19 to the pulse compression filter 40 is written as the following vector: {right arrow over (A)}=(a₁, a₂, . . . , a_(N)),  (1) called first input vector. Here the vector components a₁, . . . , a_(N) are the I/Q sampled data of an input chirp pulse in order of range (distance). They correspond to the sampled values of the input chirp pulse at each range.

Then, the filtering coefficient vector {right arrow over (H)} of the pulse compression filter 40 (the FIR filter with N taps shown in FIG. 4) is written as

$\begin{matrix} \begin{matrix} {\overset{\rightarrow}{H} = \left( {h_{1},h_{2},\ldots\mspace{14mu},h_{N}} \right)} \\ {= \left( {{w_{1}C_{1}},{w_{2}C_{2}},\ldots\mspace{14mu},{w_{N}C_{N}}} \right)} \\ {{= {\overset{\rightarrow}{C}W}},\ldots} \end{matrix} & (2) \end{matrix}$ called third coefficient vector, where {right arrow over (C)}=(C₁, C₂, . . . , C_(N))=(a_(N)*, a_(N−1)*, . . . , a₁*),  (3)

$\begin{matrix} {W = {\begin{bmatrix} w_{1} & \; & \; & O \\ \; & w_{2} & \; & \; \\ \; & \; & ⋰ & \; \\ O & \; & \; & w_{N} \end{bmatrix} = {{{diag}(W)}.}}} & (4) \end{matrix}$ Here C represents the filtering coefficient vector of an matched filter, called forth coefficient vector, W a weight matrix, corresponding to a window function, which is a diagonal matrix having N×N elements, the mathematical symbol “*” the complex conjugate of vector components, the mathematical symbol “diag” the diagonal matrix.

Then, the time series of the output pulse signal outputted from the pulse compression filter 40 to the DFT processor 21 is represented by the following vector: {right arrow over (y)}=(y₁, y₂, . . . , y_(2N−1))={right arrow over (H)}X^(T)={right arrow over (C)}WX^(T),  (5) called first output vector, where

$\begin{matrix} {{\left. {X = \overset{\overset{N}{︷}}{\begin{bmatrix} a_{1} & \; & O & \; \\ a_{2} & a_{1} & \; & \; \\ {\vdots\;} & \; & ⋰ & \; \\ a_{N} & {\; a_{N - 1}} & \cdots & a_{1} \\ \; & {a_{N}\;} & \; & a_{2} \\ \; & \; & ⋰ & \vdots \\ \; & O & \; & a_{N} \end{bmatrix}}}\mspace{11mu} \right\} 2N} - 1.} & (6) \end{matrix}$ Here X represents the state matrix, having N×(2N−1) elements, of the input chirp signal inputted in each delay element (D) of the FIR filter (the pulse compression filter 40), and the mathematical symbol “T” the transverse matrix of a matrix.

Substituting (2)–(4) and (6) into the equation (5), we obtain

$\begin{matrix} {y = \overset{\overset{{2N} - 1}{︷}}{\begin{matrix} \left( {{w_{1}a_{N}^{*}a_{1}},{{w_{1}a_{N}^{*}a_{2}} + {w_{2}a_{N - 1}^{*}a_{1}}},} \right. \\ {\left. {{{w_{1}a_{N}^{*}a_{3}} + {w_{2}a_{N - 1}^{*}a_{2}} + {w_{3}a_{N - 2}^{*}a_{3}}},\ldots\mspace{20mu},{w_{N}a_{1}^{*}a_{N}}} \right).} \end{matrix}}} & (7) \end{matrix}$ As can be expected from (7), each component of the first output vector {right arrow over (y)} is composed of the expectation value of the correlation of the components a₁, . . . , a_(N) of the first input vector {right arrow over (A)}. Therefore, this first output vector {right arrow over (y)} is called correlation output or compression filter output.

[Formulation of Pulse Compression Processing in Frequency Space]

The pulse compression processing has recently tended to be executed more in the frequency space that is the spectral space of the real space than in the real space that the correlation processing shown in (1)–(5) is implemented. In particular, for improving the processing efficiency, the pulse compression processing in the frequency space deals with the sampled series of an input data sequence having longer length (N_(f)) than that (N) of the sampled series given by (1). Further, in many cases, the sampled series of the input data sequence is directly calculated by the A/D transformation processing with a high sampling frequency in order to meet the requirement of wide dynamics range and others. This means that fine sampled data having longer length than that of the minimum sampled data equivalent to pulse compression ratio is inputted in the pulse compression filter 40.

Under such a tendency, the zero sidelobe calculator 32 deals with frequency spectrum in the frequency space obtained by applying the Fast Fourier Transformation (FFT) to new input and output vectors {right arrow over (A)}_(z), {right arrow over (y)}_(z) of the real space, called second input and output vectors, instead of the first input and output vectors {right arrow over (A)}, {right arrow over (y)} of the real space, that is:

$\begin{matrix} {\overset{{vector}\mspace{14mu}{in}\mspace{14mu}{real}\mspace{14mu}{space}}{\overset{︷}{\overset{\rightarrow}{y} = {\overset{\rightarrow}{H}X^{T}}}}\;} & (5) \\ {\begin{matrix} \overset{\overset{{Fast}\mspace{14mu}{Forier}\mspace{14mu}{Tansformation}}{︷}}{\rightarrow} \\ \underset{\underset{{Inverse}\mspace{14mu}{Fast}\mspace{14mu}{Fourier}\mspace{14mu}{Transformation}}{︸}}{\leftarrow} \end{matrix}\overset{\overset{{vector}\mspace{14mu}{in}\mspace{14mu}{frequency}\mspace{14mu}{space}}{︷}}{{Q{\overset{\rightarrow}{y}}_{z}^{T}} = {{Q\left( {{\overset{\rightarrow}{H}}_{z}X_{z}^{T}} \right)} = {{QX}_{z}{\overset{\rightarrow}{H}}_{z}^{T}}}}\mspace{14mu}{where}} & (7) \\ {{Q = \begin{bmatrix} q_{11} & \cdots & q_{1N_{f}} \\ \vdots & ⋰ & \vdots \\ q_{N_{f}1} & \cdots & q_{N_{f}N_{f}} \end{bmatrix}},} & (8) \\ {{q_{nk} = {\mathbb{e}}^{{- j}\;\frac{2\;\pi}{N_{f}}{({n - 1})}{({k - 1})}}},} & (9) \\ {{{\overset{\rightarrow}{y}}_{z} = {\left( {y_{1},y_{2},{\cdots\mspace{14mu} y_{{2N} - 1}},\overset{\overset{N_{f} - {({{2N} - 1})}}{︷}}{0,\cdots\mspace{14mu},0}} \right) \equiv \left( {\overset{\rightarrow}{y},\overset{\overset{N_{f} - {({{2N} - 1})}}{︷}}{0,\cdots\mspace{14mu},0}} \right)}},} & (10) \\ {{{\overset{\rightarrow}{H}}_{z} = {\left( {h_{1},h_{2},{\cdots\mspace{14mu} h_{N}},\overset{\overset{N_{f} - N}{︷}}{0,\cdots\mspace{14mu},0}} \right) \equiv \left( {\overset{\rightarrow}{H},\overset{\overset{N_{f} - N}{︷}}{0,\cdots\mspace{14mu},0}} \right)}},} & (11) \\ \begin{matrix} {\overset{N_{f} - N}{︷}\mspace{45mu}} \\ {{{\left. {X_{z} = \begin{bmatrix} X & O \\ O & O \end{bmatrix}}\mspace{14mu} \right\} N_{f}} - \left( {{2N} - 1} \right)},} \end{matrix} & (12) \\ {{{\overset{\rightarrow}{A}}_{z} = {\left( {a_{1},a_{2},{\cdots\mspace{14mu} a_{N}},\overset{\overset{N_{f} - N}{︷}}{0,\cdots\mspace{14mu},0}} \right) \equiv \left( {\overset{\rightarrow}{A},\overset{\overset{N_{f} - N}{︷}}{0,\cdots\mspace{14mu},0}} \right)}},} & (13) \\ {{\overset{\rightarrow}{C}}_{z} = {\left( {C_{1},C_{2},\cdots,C_{N},\overset{\overset{N_{f} - N}{︷}}{0,\cdots\mspace{14mu},0}} \right) \equiv {\left( {\overset{\rightarrow}{C},\overset{\overset{N_{f} - N}{︷}}{0,\cdots\mspace{14mu},0}} \right).}}} & (14) \end{matrix}$ Here Q represents the FFT matrix, n,k the positive integers from 1 to N_(f), N_(f) the numbers of the sampled point of the FFT, {right arrow over (y)}_(z) the second output vector made by adding N_(f)−(2N−1) zero components to the first output vector {right arrow over (y)} given by the equation (5), {right arrow over (H)}_(z) a fourth coefficient vector made by adding N_(f)−N zero components to the third coefficient vector {right arrow over (H)} given by (2), {right arrow over (A)}_(z) the second input vector made by adding N_(f)−N zero components to the first input vector {right arrow over (A)} given by (1), and {right arrow over (C)}_(z) the new filtering coefficient vector of the matched filter made by adding N_(f)−N zero components to the fourth coefficient vector {right arrow over (C)} given by (3). This new filtering coefficient vector {right arrow over (C)}_(z) is called fifth coefficient vector. As described above, the number (N_(f)) of the sampled series of the FFT is more than that (2N−1) of sampled series of the output signal outputted from the pulse compression filter 40. Since the pulse compression processing in the frequency space via the FFT can treat wide sweep range, this favors normal radar systems.

Substituting (8)–(14) into the equation (7), we obtain

$\begin{matrix} {\begin{matrix} {{Q{\overset{\rightarrow}{y}}_{z}^{T}} = {{{QX}_{z}{\overset{\rightarrow}{H}}_{z}^{T}} = {{{QX}_{z}E{\overset{\rightarrow}{H}}_{z}^{T}} = {{{{QX}_{z}\left( {\hat{Q}Q} \right)}{\overset{\rightarrow}{H}}_{z}^{T}} = {\left( {{QX}_{z}\hat{Q}} \right)\left( {Q{\overset{\rightarrow}{H}}_{z}^{T}} \right)}}}}} \\ {= {\begin{bmatrix} \left( {Q{\overset{\rightarrow}{A}}_{z}^{T}} \right)_{1} & \cdots & O \\ \vdots & ⋰ & \vdots \\ O & \cdots & \left( {Q{\overset{\rightarrow}{A}}_{z}^{T}} \right)_{1} \end{bmatrix}\left( {Q{\overset{\rightarrow}{H}}_{z}^{T}} \right)}} \\ {= {{{diag}\left( {Q{\overset{\rightarrow}{A}}_{z}^{T}} \right)}\left( {Q{\overset{\rightarrow}{H}}_{z}^{T}} \right)}} \end{matrix}{where}} & (15) \\ {\hat{Q} \equiv {\frac{Q^{*}}{N_{f}}.}} & (16) \end{matrix}$ Here {circumflex over (Q)} represents the Inverse FFT (IFFT) matrix of the FFT matrix Q satisfying the following normalization condition: Q{circumflex over (Q)}=E  (17) where E is the unit matrix.

Under the assumption described above, a third output vector {right arrow over (y)}_(mz) satisfying the sidelobe free condition is defined as follows:

$\begin{matrix} \begin{matrix} {{\overset{\rightarrow}{y}}_{mz} = \left( {0,{\cdots\mspace{14mu} 0},y_{N - {Nx}},\cdots\mspace{14mu},y_{N},\cdots\mspace{14mu},y_{N + {Nx}},0,\cdots\mspace{14mu},0,\overset{\overset{N_{f} - {({{rN} - 1})}}{︷}}{0,\cdots\mspace{14mu},0}} \right)} \\ {\equiv \left( {{\overset{\rightarrow}{y}}_{m},\overset{\overset{N_{f} - {({{2N} - 1})}}{︷}}{0,\cdots\mspace{14mu},0}} \right)} \\ {\equiv {{\overset{\rightarrow}{H}}_{dz}H_{z}^{T}}} \end{matrix} & (18) \end{matrix}$ where {right arrow over (y)}_(m)=(0, . . . 0, y_(N−Nx), . . . , y_(N), . . . , y_(N+Nx), 0, . . . , 0).  (19) Here {right arrow over (H)}_(dz) represents the first coefficient vector of the present invention described above. The third output vector {right arrow over (y)}_(mz) satisfies the condition that remains samples y_(N−Nx), . . . y_(N), . . . , y_(N+Nx) in a vicinity of the peak sample y_(N) in the time series of the output signal represented by the equation (5) while reducing other samples to zero.

Multiplying both hand sides of the equation (18) by the FFT matrix Q from the left, with reference to the equation (15), we get

$\begin{matrix} \begin{matrix} {{Q{\overset{\rightarrow}{y}}_{mz}^{T}} = {{QX}_{z}{\overset{\rightarrow}{H}}_{dz}^{T}}} \\ {= {\left( {{QX}_{z}\hat{Q}} \right)\left( {Q{\overset{\rightarrow}{H}}_{dz}^{T}} \right)}} \\ {= {{{diag}\left( {Q{\overset{\rightarrow}{A}}_{z}^{T}} \right)}{\left( {Q{\overset{\rightarrow}{H}}_{dz}^{T}} \right).}}} \end{matrix} & (20) \end{matrix}$ Further, multiplying both hand sides of the equation (20) by the diagonal matrix [diag(Q{right arrow over (A)}_(z) ^(T))]⁻¹ from the left, we obtain Q{right arrow over (H)}_(dz) ^(T)[diag(Q{right arrow over (A)}_(z) ^(T))]⁻¹Q{right arrow over (y)}_(mz) ^(T).  (21) Furthermore, multiplying both hand sides of the equation (21) by the IFFT matrix {circumflex over (Q)} from the left, we finally obtain the following equation:

$\begin{matrix} {\begin{matrix} {{\overset{\rightarrow}{H}}_{dz}^{T} = {\hat{Q}\left( {Q{\overset{\rightarrow}{H}}_{dz}^{T}} \right)}} \\ {= {{\hat{Q}\left\lbrack {{diag}\left( {Q{\overset{\rightarrow}{A}}_{z}^{T}} \right)} \right\rbrack}^{- 1}Q{\overset{\rightarrow}{y}}_{mz}^{T}}} \\ {= {\hat{Q}{BQ}{\overset{\rightarrow}{y}}_{mz}^{T}}} \end{matrix}{where}} & (22) \\ {B = {\begin{bmatrix} \frac{1}{\left( {Q{\overset{\rightarrow}{A}}_{z}^{T}} \right)_{1}} & \cdots & O \\ \vdots & ⋰ & \vdots \\ O & \cdots & \frac{1}{\left( {Q{\overset{\rightarrow}{A}}_{z}^{T}} \right)_{N_{f}}} \end{bmatrix}.}} & (23) \end{matrix}$

The equation (22) shows that the first coefficient vector {right arrow over (H)}_(dz) satisfying the sidelobe free condition is determined by the third output vector {right arrow over (y)}_(mz) given by the equation (18). Further, as is easily understood from the above discussion, the third output signal {right arrow over (y)}_(mz) is determined by the fourth coefficient vector {right arrow over (H)}_(z). From this, we can find that the first coefficient vector {right arrow over (H)}_(dz) is determined by the fourth coefficient vector {right arrow over (H)}_(z).

In the present invention, the zero sidelobe calculator 32 outputs the first coefficient vector {right arrow over (H)}_(dz) given by the equation (22) to the pulse compression filter 40.

Although in this way the first coefficient vector {right arrow over (H)}_(dz) satisfying the sidelobe free condition is calculated by the pulse compression processing described above, such a pulse compression processing is generally affected by large S/N loss under background noise.

Therefore, next let us derivate a condition for minimizing S/N loss with the sidelobe free described above.

[Condition for Minimizing S/N Loss with the Sidelobe Free]

The average power of the first input signal {right arrow over (A)} given by (1) inputted in the pulse compression filter 40 is defined as

$\begin{matrix} {S_{in} = \frac{\overset{\rightarrow}{A} \cdot \left( {\overset{\rightarrow}{A}}^{T} \right)^{*}}{N}} & (24) \end{matrix}$ where N is the number of the sampled series of the first input signal {right arrow over (A)} given by (1), and the mathematical symbol “·” the inner product of vectors.

The average power of the noise introduced in the first input signal {right arrow over (A)} given by (1) inputted in the pulse compression filter 40 is written as N_(in)=σ².  (25) Here we assume that the noise introduced in each sample of the input chirp signal is uncorrelated. This assumption means that the sampled series of an input chirp signal is sampled with a frequency equivalent to noise bandwidth, namely the sampled series of the noise introduced in the input chirp signal is sampled with equal or higher frequency than that of the chirp input signal.

The peak value of the power of the third output signal {right arrow over (y)}_(mz) given by the equation (18) outputted from the pulse compression filter 40 is defined as

$\begin{matrix} \begin{matrix} {S_{out} = {\left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{H}}_{dz}^{T}} \right)\left\{ \left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{H}}_{dz}^{T}} \right)^{T} \right\}^{*}}} \\ {{= {\left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{H}}_{dz}^{T}} \right)\left( {{\overset{\rightarrow}{H}}_{dz}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right)}},} \end{matrix} & (26) \end{matrix}$ and the average power of the noise introduced in the third output signal {right arrow over (y)}_(mz) given by the equation (18) outputted from the pulse compression filter 40 is defined as N _(out) ={{right arrow over (H)} _(dz)·({right arrow over (H)}_(dz) ^(T))*}σ².  (27)

Further, the peak value of the power of an output signal outputted from a pulse compression filter with a matched filter is represented as

$\begin{matrix} \begin{matrix} {S_{0} = {\left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right)\left\{ \left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right)^{T} \right\}^{*}}} \\ {{= {\left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right)\left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right)}},} \end{matrix} & (28) \end{matrix}$ and the average power of the noise introduced in the output signal outputted from the pulse compression filter with the matched filter is represented as N ₀ ={{right arrow over (C)} ₂·({right arrow over (C)} ₂ ^(T))*}σ².  (29) Then, the index L of S/N loss is defined as follows:

$\begin{matrix} \begin{matrix} {L \equiv \frac{\left( \frac{S_{out}/N_{out}}{S_{in}/N_{in}} \right)}{\left( \frac{S_{0}/N_{0}}{S_{in}/N_{in}} \right)}} \\ {= {\frac{S_{out}}{N_{out}} \times {\frac{N_{0}}{S_{0}}.}}} \end{matrix} & (30) \end{matrix}$ Substituting (24)–(29) into the definition (30) of the index L, we obtain

$\begin{matrix} {\begin{matrix} {L = {\frac{S_{out}}{N_{out}} \cdot \frac{N_{0}}{S_{0}}}} \\ {= {\frac{\left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{H}}_{dz}^{T}} \right)\left( {{\overset{\rightarrow}{H}}_{dz}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right)}{\left\{ {{\overset{\rightarrow}{H}}_{dz} \cdot \left( {\overset{\rightarrow}{H}}_{dz}^{T} \right)^{*}} \right\}\sigma^{2}} \times \frac{\left\{ {{\overset{\rightarrow}{C}}_{z} \cdot \left( {\overset{\rightarrow}{C}}_{z}^{T} \right)^{*}} \right\}\sigma^{2}}{\left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right)\left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right)}}} \\ {= {\frac{\left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{H}}_{dz}^{T}} \right)\left( {{\overset{\rightarrow}{H}}_{dz}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right)}{{\overset{\rightarrow}{H}}_{dz} \cdot \left( {\overset{\rightarrow}{H}}_{dz}^{T} \right)^{*}} \times {\frac{1}{{\overset{\rightarrow}{C}}_{z} \cdot \left( {\overset{\rightarrow}{C}}_{z}^{T} \right)^{*}}.}}} \end{matrix}{\left( {{\because{{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}}} = {{\overset{\rightarrow}{C}}_{z} \cdot \left( {\overset{\rightarrow}{C}}_{z}^{T} \right)^{*}}} \right).}} & (31) \end{matrix}$ The index L indicates that the more its value is close to 1, the more S/N loss decreases.

Since it is difficult to analytically derivate the condition for minimizing S/N loss from (31), we use the following identity:

$\begin{matrix} {{\left. \begin{matrix} {{\overset{\rightarrow}{H}}_{dz}^{T} = {\hat{Q}\mspace{11mu}{BQ}{\overset{\rightarrow}{y}}_{mz}^{T}}} \\ {= {\hat{Q}\mspace{11mu}{BQX}_{mz}{\overset{\rightarrow}{H}}_{z}^{T}\mspace{14mu}\left( {\because{{Eq}.\mspace{14mu}(18)}} \right)}} \\ {= {u{\overset{\rightarrow}{H}}_{z}^{T}}} \end{matrix}\leftrightarrow{\overset{\rightarrow}{H}}_{dz} \right. = {{\overset{\rightarrow}{H}}_{z}u^{T}}}{where}} & (32) \\ {{{u \equiv {\hat{Q}\mspace{11mu}{BQX}_{mz}}} = \frac{Q^{*}{BQX}_{mz}}{N_{f}}},\left( {\because{{Eq}.\mspace{14mu}(16)}} \right)} & (33) \\ \begin{matrix} {\overset{N_{f} - N}{︷}\mspace{45mu}} \\ {{{\left. {X_{mz} = \begin{bmatrix} X_{m} & O \\ O & O \end{bmatrix}}\mspace{14mu} \right\} N_{f}} - \left( {{2N} - 1} \right)},} \end{matrix} & (34) \\ {{\left. {X_{m} = \overset{\overset{N}{︷}}{\begin{bmatrix} \; & \; & \; & O & \; & \; & O \\ a_{N - {Nx}} & \cdots & \; & \cdots & a_{1} & \; & \; \\ \vdots & \; & \; & \; & \; & ⋰ & \; \\ a_{N} & \cdots & \; & \cdots & \; & \cdots & a_{1} \\ \; & ⋰ & \; & \; & \; & \; & \vdots \\ \; & \; & a_{N} & \cdots & \; & \cdots & a_{{Nx} + 1} \\ O & \; & \; & O & \; & \; & \; \end{bmatrix}}}\mspace{11mu} \right\} 2N} - 1.} & (35) \end{matrix}$ Here X_(m) is the new state matrix, having N×(2N−1) elements, of the input signal inputted in each delay element (D) of the FIR filter (the pulse compression filter 40).

Then, (31) is further modified to the quadratic form of the fourth coefficient vector {right arrow over (H)}_(z) by using the equation (32) as follows:

$\begin{matrix} \begin{matrix} {L = {\frac{\left( {{\overset{\rightarrow}{C}}_{z}^{*} \cdot {\overset{\rightarrow}{H}}_{dz}^{T}} \right)\left( {{\overset{\rightarrow}{H}}_{dz}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right)}{{\overset{\rightarrow}{H}}_{dz} \cdot \left( {\overset{\rightarrow}{H}}_{dz}^{T} \right)^{*}} \times \frac{1}{{\overset{\rightarrow}{C}}_{z} \cdot \left( {\overset{\rightarrow}{C}}_{z}^{T} \right)^{*}}}} \\ {= {\frac{\left\{ {{\overset{\rightarrow}{C}}_{z}^{*} \cdot \left( {u{\overset{\rightarrow}{H}}_{z}^{T}} \right)} \right\}\left\lbrack {\left\{ \left( {u{\overset{\rightarrow}{H}}_{z}^{T}} \right)^{T} \right\}^{*} \cdot {\overset{\rightarrow}{C}}_{z}^{T}} \right\rbrack}{\left( {{\overset{\rightarrow}{H}}_{z}u^{T}} \right) \cdot \left( {u{\overset{\rightarrow}{H}}_{z}^{T}} \right)^{*}} \times \frac{1}{{\overset{\rightarrow}{C}}_{z} \cdot \left( {\overset{\rightarrow}{C}}_{z}^{T} \right)^{*}}}} \\ {= {\frac{{\left\{ {\left( {{\overset{\rightarrow}{C}}_{z}^{*}u} \right) \cdot {\overset{\rightarrow}{H}}_{z}^{T}} \right\}\left\lbrack \left\{ {\left( {{\overset{\rightarrow}{C}}_{z}^{*}u} \right){\overset{\rightarrow}{H}}_{z}^{T}} \right\}^{T} \right\rbrack}^{*}}{{\overset{\rightarrow}{H}}_{z}u^{T}{u^{*}\left( {\overset{\rightarrow}{H}}_{z}^{T} \right)}^{*}} \times {\frac{1}{{\overset{\rightarrow}{C}}_{z} \cdot \left( {\overset{\rightarrow}{C}}_{z}^{T} \right)^{*}}.}}} \end{matrix} & (36) \end{matrix}$

Further, substituting the following equation (37) into (36):

$\begin{matrix} {\begin{matrix} {{u^{T}u^{*}} = {\left( {\hat{Q}\mspace{11mu}{BQX}_{mz}} \right)^{T}\left( {\hat{Q}\mspace{11mu}{BQX}_{mz}} \right)^{*}}} \\ {= {X_{mz}^{T}Q^{T}{B^{T}\left( {{\hat{Q}}^{T}{\hat{Q}}^{*}} \right)}B^{*}Q^{*}X_{mz}^{*}}} \\ {{= \frac{X_{mz}^{T}Q^{T}B^{T}B^{*}Q^{*}X_{mz}^{*}}{N_{f}}},\left( {{\because{{\hat{Q}}^{T}{\hat{Q}}^{*}}} = {{\frac{\left( Q^{*} \right)^{T}}{N_{f}} \cdot \frac{Q}{N_{f}}} = \frac{E}{N_{f}}}} \right)} \end{matrix}{{we}\mspace{14mu}{get}}} & (37) \\ {L = {\frac{{\left\{ {\left( {{\overset{\rightarrow}{C}}_{z}^{*}u} \right) \cdot {\overset{\rightarrow}{H}}_{z}^{T}} \right\}\left\lbrack \left\{ {\left( {{\overset{\rightarrow}{C}}_{z}^{*}u} \right) \cdot {\overset{\rightarrow}{H}}_{z}^{T}} \right\}^{T} \right\rbrack}^{*}}{{\overset{\rightarrow}{H}}_{z}\left\{ {{X_{mz}^{T}\left( {Q^{T}B^{T}B^{*}Q^{*}} \right)}X_{mz}^{*}} \right\}\left( {\overset{\rightarrow}{H}}_{z}^{T} \right)^{*}} \times {\frac{N_{f}}{{\overset{\rightarrow}{C}}_{z} \cdot \left( {\overset{\rightarrow}{C}}_{z}^{T} \right)^{*}}.}}} & (38) \end{matrix}$

Furthermore, substituting the following definitions (39)–(41) into (38):

$\begin{matrix} {{\overset{\rightarrow}{v} \equiv {{\overset{\rightarrow}{C}}_{z}^{*}u}},} & (39) \\ {{z \equiv {{X_{mz}^{T}\left( {Q^{T}B^{T}B^{*}Q^{*}} \right)}X_{mz}^{*}}},} & (40) \\ {{\beta \equiv \frac{N_{f}}{{\overset{\rightarrow}{C}}_{z} \cdot \left( {\overset{\rightarrow}{C}}_{z}^{T} \right)^{*}}},{{we}\mspace{14mu}{get}}} & (41) \\ {L = {\frac{\left( {\overset{\rightarrow}{v} \cdot {\overset{\rightarrow}{H}}_{z}^{T}} \right)\left\{ \left( {\overset{\rightarrow}{v} \cdot {\overset{\rightarrow}{H}}_{z}^{T}} \right)^{T} \right\}^{*}}{{\overset{\rightarrow}{H}}_{z}{z\left( {\overset{\rightarrow}{H}}_{z}^{T} \right)}^{*}}{\beta.}}} & (42) \end{matrix}$ Further, substituting the new vectors {right arrow over (F)}, {right arrow over (G)} defined as follows: {right arrow over (F)}≡{right arrow over (v)}(z^(1/2))*,  (43) {right arrow over (G)}≡{right arrow over (H)}_(z)*(z^(1/2))*⇄({right arrow over (G)}^(T))*=(z^(1/2))*{right arrow over (H)}_(z) ^(T),  (44) into (42), we obtain

$\begin{matrix} {L = {\frac{{\left\{ {\overset{\rightarrow}{F} \cdot \left( {\overset{\rightarrow}{G}}^{T} \right)^{*}} \right\}\left\lbrack \left\{ {\overset{\rightarrow}{F} \cdot \left( {\overset{\rightarrow}{G}}^{T} \right)^{*}} \right\}^{T} \right\rbrack}^{*}}{{\overset{\rightarrow}{G}}^{*} \cdot {\overset{\rightarrow}{G}}^{T}}{\beta.}}} & (45) \end{matrix}$ Applying the Schwartz inequality: {{right arrow over (F)}·({right arrow over (G)} ^(T))*}[{{right arrow over (F)}·({right arrow over (G)} ^(T))*}^(T) ]*≦{{right arrow over (F)}·({right arrow over (F)} ^(T))*}{{right arrow over (G)}·({right arrow over (G)} ^(T))*}  (46) to (45), we can estimate the index L of S/N loss, that is (45), as the following inequality:

$\begin{matrix} \begin{matrix} {L = {{\frac{{\left\{ {\overset{\rightarrow}{F} \cdot \left( {\overset{\rightarrow}{G}}^{T} \right)^{*}} \right\}\left\lbrack \left\{ {\overset{\rightarrow}{F} \cdot \left( {\overset{\rightarrow}{G}}^{T} \right)^{*}} \right\}^{T} \right\rbrack}^{*}}{{\overset{\rightarrow}{G}}^{*} \cdot {\overset{\rightarrow}{G}}^{T}}\beta} \leq {\frac{\left\{ {\overset{\rightarrow}{F} \cdot \left( {\overset{\rightarrow}{F}}^{T} \right)^{*}} \right\}\left\{ {\overset{\rightarrow}{G} \cdot \left( {\overset{\rightarrow}{G}}^{T} \right)^{*}} \right\}}{{\overset{\rightarrow}{G}}^{*} \cdot {\overset{\rightarrow}{G}}^{T}}\beta}}} \\ {= {\left\{ {F \cdot \left( F^{T} \right)^{*}} \right\}\beta}} \\ {= {\left\lbrack {{v\left( z^{- \frac{1}{2}} \right)}^{*} \cdot \left\{ {\left( z^{- \frac{1}{2}} \right)^{*}\left( v^{T} \right)^{*}} \right\}} \right\rbrack\beta\mspace{14mu}\left( {{\because{{Eq}.\mspace{14mu}(43)}},{z^{*} = z^{T}}} \right)}} \\ {= {\left\{ {{v\left( z^{- 1} \right)}^{*}\left( v^{T} \right)^{*}} \right\}{\beta.}}} \end{matrix} & (47) \end{matrix}$

The condition having quality in the inequality (47) is α{right arrow over (F)}={right arrow over (G)},  (48) where α is arbitrary constant of complex number.

Thus, substituting the definitions (43) and (44) into the condition (48), we get α{right arrow over (v)}(z^(−1/2))={right arrow over (H)}_(z)*(z^(1/2))*,  (49) and further multiplying both hand sides of the equation (49) by the matrix (z^(1/2))* from right, we get α{right arrow over (v)}={right arrow over (H)}_(z)*z*=α{right arrow over (C)}_(z)*u, (∵Eq. (39))  (50) furthermore multiplying both hand sides of the equaiton (50) by the matrix (z⁻²)* from the right, we finally obtain {right arrow over (H)} _(z)*=α({right arrow over (C)} _(z) *u)(z ⁻¹)*,  (51) ∴{right arrow over (H)}_(z)=α*{right arrow over (C)}_(z)u*z⁻¹≡{right arrow over (H)}_(zM).  (52)

The equation (52) is the condition for minimizing S/N loss. From this, we can find that the first coefficient vector {right arrow over (H)}_(dz) given by the equation (32) with the second coefficient vector {right arrow over (H)}_(zM) as the fourth coefficient vector {right arrow over (H)}_(z) given by the equation (52) satisfies the sidelobe free with minimum S/N loss.

In the present invention, the minimun S/N calculator 31 calculates the fourth coefficient vector {right arrow over (H)}_(z) (i.e. the second coefficient vector {right arrow over (H)}_(zM)) represented by the equation (52), resulting in transmitting the fourth coefficient vector {right arrow over (H)}_(z) (i.e. the second coefficient vector {right arrow over (H)}_(zM)) to the zero sidelobe calculator 32. Next, the zero sidelobe calculator 32 substitutes the fourth coefficient vector {right arrow over (H)}_(z) (i.e. the second coefficient vector {right arrow over (H)}_(zM)) into the first coefficient vector {right arrow over (H)}_(dz) represented by the equation (32), resulting in the first coefficient vector {right arrow over (H)}_(dz) satisfying the sidelobe free with minimum S/N loss to the pulse compression filter 40.

<Second Embodiment>

In the first embodiment of the present invention described above, as shown in FIG. 3, the output quantities transmitted to the pulse compressing filter (the FIR filter) 40 are the input signal {right arrow over (A)} given by (1) and the first coefficient vector {right arrow over (H)}_(dz) given by the equation (32).

As is easily understood, these quantities belong to the real space. Namely, in the first embodiment of the present invention, the operating processes in the frequency space are executed only in the filtering coefficient calculator 30, that is, the minimum S/N loss calculator 31 and zero sidelobe calculatior 32.

The second embodiment of the present invention permits the pulse compression processing to be executed in the frequency space.

Let us explain the schematic construction of the pulse compression processor according to the second embodiment of the present invention with reference to FIGS. 5A and 5B.

FIG. 5A is a functional block diagram showing the first example of a pulse compression processor according to the second embodiment of the present invention. Hereinafter, the same component parts as those of the first embodiment bear the same reference numbers for describing differences from the first embodiment.

The pulse compression processor 20 a of the first example of the second embodiment comprises a filtering coefficient calculator 30 a, a pulse compression filter 40 a.

The filtering coefficient calculator 30 a comprises a minimum S/N loss calculator 31, a zero sidelobe calculator 32, and a first Fourier transformation operator 33. This filtering coefficient calculator 30 a calculates the filtering coefficient vector of the frequency space given in the pulse compression filter 40 a. The details are as follows:

The minimum S/N loss calculator 31 calculates the second coefficient data as the second coefficient vector {right arrow over (H)}_(zM) given by the equation (52) that theoretically minimizes S/N loss.

The zero sidelobe calculator 32 calculates the first coefficient data as the first coefficient vector {right arrow over (H)}_(dz) given by the equation (32) for reducing sidelobe level to zero (the sidelobe free), based on the second coefficient vector {right arrow over (H)}_(zM) calculated by the minimum S/N loss calculator 31, resulting in transmitting the first coefficient vector {right arrow over (H)}_(dz) to the first Fourier transformation operator 33.

The operating processes of the minimum S/N loss calculator 31 and the zero sidelobe calculator 32 are executed in the same manner as the first embodiment of the present invention.

The first Fourier transformation operator 33 generates the transformed coefficient vector Q{right arrow over (H)}_(dz) ^(T) of the frequency space, called spectral first coefficient vector, by operating the fast Fourier transformation Q given by (8) to the first coefficient vector {right arrow over (H)}_(dz) of the real space, resulting in transmitting the spectral first coefficient vector Q{right arrow over (H)}_(dz) ^(T) of the frequency space to the pulse compression filter 40 a.

As shown in FIG. 5A, the pulse compression filter 40 a includes a second Fourier transformation operator 41, a multiply operator 42, and an inverse Fourier transformation operator 43.

The second Fourier transformation operator 41 generates the transformed input signal Q{right arrow over (A)}_(z) ^(T) of the frequency space, called spectral first input vector, by operating the fast Fourier transformation Q given by (8) to the second input vector {right arrow over (A)}_(z) of the real space, resulting in transmitting the spectral second input signal Q{right arrow over (A)}_(z) ^(T) to the multiply operator 42.

The multiply operator 42 compresses the spectral second input vector Q{right arrow over (A)}_(z) ^(T) transmitted from the second Fourier transformation operator 41, based on the spectral second coefficient vector Q{right arrow over (H)}_(dz) ^(T) transmitted from the first Fourier transformation operator 33, resulting in transmitting the compressed signal Q{right arrow over (y)}_(mz) ^(T) of the frequency space to the inverse Fourier transformation operator 43, by using the equations (32) and (23).

The inverse Fourier transforming operator 43 generates the output signal {right arrow over (y)}_(mz) ({right arrow over (y)}_(mz) ^(T)) of the real space, that is, the time domain data of the output signal, by operating the inverse fast Fourier transformation {circumflex over (Q)} given by (16) to the compressed signal Q{right arrow over (y)}_(mz) ^(T) of the frequency space, that is, the frequency domain data of the output signal, resulting in outputting the output signal {right arrow over (y)}_(mz) of the real space, which is equivalent to the first embodiment of the present invention, to the discrete Fourier transforming operator 21.

FIG. 5B is a schematic block diagram showing the second example of a pulse compression processor according to the second embodiment of the present invention. Hereinafter, the same component parts as those of the first embodiment bear the same reference numbers for describing differences from the first embodiment.

The pulse compression processor 20 b of the second example of the second embodiment comprises a filtering coefficient calculator 30 b, a pulse compression filter 40 a.

The filtering coefficient calculator 30 a is comprised of a minimum S/N loss calculator 31, a zero sidelobe calculator 32 a. This filtering coefficient calculator 30 a calculates the filtering coefficient vector of the frequency space given in the pulse compression filter 40 a. The details are as follows:

The minimum S/N loss calculator 31 calculates the transformed coefficient data as the second coefficient vector {right arrow over (H)}_(zM) given by the equation (52) that theoretically minimizes S/N loss.

The zero sidelobe calculator 32 a calculates the first coefficient data as a first coefficient vector Q{right arrow over (H)}_(dz) of the frequency space, called spectral first coefficient vector, given by the equation (21) for reducing sidelobe level to zero (the sidelobe free), based on the second coefficient vector {right arrow over (H)}_(zM) calculated by the minimum S/N loss calculator 31, resulting in transmitting the spectral first coefficient vector Q{right arrow over (H)}_(dz) of the frequency space to the second Fourier transformation operator 41.

The pulse compression filter 40 a includes a second Fourier transformation operator 41, a multiply operator 42, and an inverse Fourier transforming operator 43.

The second Fourier transforming operator 41 generates the transformed input signal Q{right arrow over (A)}_(z) ^(T) of the frequency space, called spectral first input vector, by operating the fast Fourier transformation Q given by (8) to the second input vector {right arrow over (A)}_(z) of the real space, resulting in transmitting the spectral second input signal Q{right arrow over (A)}_(z) ^(T) to the multiply operator 42.

The multiply operator 42 compresses the spectral second input vector Q{right arrow over (A)}_(z) ^(T) transmitted from the second Fourier transformation operator 41, based on the spectral second coefficient vector Q{right arrow over (H)}_(dz) ^(T) transmitted from the zero sidelobe calculator 32 a, resulting in transmitting the compressed signal Q{right arrow over (y)}_(z) ^(T) of the frequency space to the inverse Fourier transformation operator 43, by using the equations (32) and (23).

The inverse Fourier transforming operator 43 generates the output signal {right arrow over (y)}_(mz) ({right arrow over (y)}_(mz) ^(T)) of the real space, that is, the time domain data of the output signal, by operating the inverse fast Fourier transformation {circumflex over (Q)} given by (16) to the compressed signal Q{right arrow over (y)}_(mz) ^(T) of the frequency space, that is, the frequency domain data of the output signal, resulting in outputting the output signal {right arrow over (y)}_(mz) ^(T) of the real space, which is equivalent to the first embodiment of the present invention, to the discrete Fourier transforming operator 21.

Simulation of Pulse compression Processing with Sidelobe Free Condition

Finally, let us provide simulations of pulse compression under the condition of the sidelobe free with minimum S/N loss (that is, the first coefficient vector {right arrow over (H)}_(dz) given by the equation (32) with the second coefficient vector {right arrow over (H)}_(zM) given by the equation (52) satisfies the sidelobe free with minimum S/N loss) obtained from the first and second embodiments of the present invention.

FIG. 6 is a graph showing a simulation of pulse compression executed by a pulse compression processing circuit according to the first and second embodiments of the present invention, and FIG. 7 is an enlarged graph showing a simulation of pulse compression executed by a pulse compression processing circuit according to the first and second embodiments of the present invention.

The parameters for these simulations are set as follows: the linear chirp modulated pulse width=64 microsec; the modulated frequency bandwidth=2.0 MHz.

In FIGS. 6 and 7, T1 shows pulse compressed waveforms outputted from the pulse compression processor according to the first and second embodiments of the present invention, and T2 shows pulse compressed waveforms outputted from a conventional pulse compression processor with the hamming window function, which is typical one.

As shown in FIG. 6, in the pulse compressed waveforms outputted from the pulse compression processor of the present invention, the sampled values in the region without a vicinity of main-lobe, i.e. the value of the sidelobe, is reduced to zero, further, the S/N loss in the peak value of the main-lobe is small, and furthermore, main-lobe width is narrow in comparison with these of the conventional pulse compression processor.

Further, FIG. 7 compares the pulse compressed waveforms outputted from the pulse compression processor of the present invention with these of the conventional pulse compression processor, based on the 3 dB main-lobe width. As shown in FIG. 7, the pulse compression method of the present invention enable the 3 dB main-lobe width to be narrow as well as enable the S/N loss to be small in comparison with the conventional pulse compression method. This shows that the pulse compression processor of the present invention can realize more higher resolution and sensitivity that that of the conventional pulse compression processor.

Finally, we should note as the following information:

-   -   (1) Although the first and second embodiments of the present         invention focus on the linear chirp pulse signal as the         modulated pulse signal, the condition for the sidelobe free with         minimum S/N loss, in other words, the relational expressions         (1)–(52), of the present invention may have applicability to         other modulated pulse signals as transmission signal transmitted         from a transmitter such as nonlinear chirp pulse signals,         discrete phase code modulated pulse signals and more.     -   (2) Although the simulations shown in FIGS. 6 and 7 are         implemented with the linear chirp pulse signal, these results         are independent of kinds of modulated pulse signals, as is         easily understood from the relational expressions (1)–(52).

-   (3) As is easily understood from the relational expressions     (1)–(52), the condition for the sidelobe free with minimum S/N loss     is independent of the various conditions of input and output signal.

It is also to be noted that, besides those already mentioned above, many modifications and variations of the above embodiments may be made without departing from the novel and advantageous features of the present invention. Accordingly, all such modifications and variations are intended to be included within the scope of the appended claims.

The present disclosure relates to subject matter contained in Japanese Patent Application No. 2003-342153, filed on Sep. 30, 2003, the disclosure of which is expressly incorporated herein by reference in its entirely. 

1. A pulse compression processor compressing a modulated pulse signal correlately received by a receiver, comprising: a coefficient calculator including a minimum S/N loss calculator that calculates a set of first filtering coefficients, that minimizes S/N loss in a peak value of a main-lobe of a compressed pulse signal, and a zero sidelobe calculator that calculates a set of second filtering coefficients that converts sampled output signal values outside a vicinity of the main-lobe into zero based on the set of the first filtering coefficients; and a pulse compression filter that compresses the modulated pulse signal based on the set of the second filtering coefficients calculated by the coefficient calculator.
 2. The pulse compression processor according to claim 1, wherein the modulated pulse signal comprises a signal with a modulated frequency.
 3. The pulse compression processor according to claim 2, wherein the pulse signal comprises a linear chirp signal.
 4. The pulse compression processor according to claim 2, wherein the pulse signal comprises a nonlinear chirp signal.
 5. The pulse compression processor according to claim 1, wherein the pulse signal comprises a signal with modulated phase.
 6. The pulse compression processor according to claim 5, wherein the pulse signal comprises a discrete phase code modulated signal.
 7. The pulse compression processor according to claim 1, wherein the coefficient calculator calculates the set of the second filtering coefficients as a coefficient vector {right arrow over (H)}_(dz) based on the modulated pulse signal as an input vector {right arrow over (A)}=(a₁, a₂. . . , a_(N)) and the following relational expressions: $\begin{matrix} {{\overset{\rightarrow}{H}}_{dz}^{T} = {{u\;{\overset{\rightarrow}{H}}_{z}^{T}} = {{\hat{Q}\; B\; Q\;{\overset{\rightarrow}{y}}_{mz}^{T}} = {\hat{Q}\; B\; Q\; X_{mz}{\overset{\rightarrow}{H}}_{z}^{T}}}}} & (1) \\ {where} & \; \\ {{{\overset{\rightarrow}{H}}_{z} = {\alpha^{*}{\overset{\rightarrow}{C}}_{z}u^{*}z^{- 1}}},} & (2) \\ {{{\overset{\rightarrow}{C}}_{z} = {\left( {a_{N}^{*},a_{N - 1}^{*},\cdots\mspace{11mu},a_{1}^{*},\overset{\overset{N_{f} - N}{︷}}{0,\cdots\mspace{11mu},0}} \right) \equiv \left( {\overset{\rightarrow}{C},\overset{\overset{N_{f} - N}{︷}}{0,\cdots\mspace{11mu},0}} \right)}},} & (3) \\ {{u \equiv {\hat{Q}\; B\; Q\; X_{mz}}},} & (4) \\ {{Q = \begin{bmatrix} q_{11} & \cdots & q_{1N_{f}} \\ \vdots & ⋰ & \vdots \\ q_{N_{f}1} & \cdots & q_{N_{f}N_{f}} \end{bmatrix}},} & (5) \\ {{\hat{Q} = \frac{Q^{*}}{N_{f}}},} & (6) \\ {{q_{nk} = {\mathbb{e}}^{{- j}\;\frac{2\pi}{N_{f}}{({n - 1})}{({k - 1})}}},} & (7) \\ {{B = \begin{bmatrix} \frac{1}{\left( {Q\;{\overset{\rightarrow}{A}}_{z}^{T}} \right)_{1}} & \cdots & O \\ \vdots & ⋰ & \vdots \\ O & \cdots & \frac{1}{\left( {Q\;{\overset{\rightarrow}{A}}_{z}^{T}} \right)_{N_{f}}} \end{bmatrix}},} & (8) \\ {{X_{mz} = {\overset{\mspace{31mu}\underset{︷}{N_{f} - N}}{\begin{bmatrix} X_{m} & O \\ O & O \end{bmatrix}}}_{{{\mspace{14mu}\}}N_{f}} - {({{2N} - 1})}}},} & (9) \\ \begin{matrix} {X_{m} = \overset{\overset{N}{︷}}{\begin{bmatrix} \; & \; & \; & O & \; & \; & O \\ a_{N - {Nx}} & \cdots & \; & \cdots & a_{1} & \; & \; \\ \vdots & \; & \; & \; & \; & ⋰ & \; \\ a_{N} & \cdots & \; & \cdots & \; & \cdots & a_{1} \\ \; & ⋰ & \; & \; & \; & \; & \vdots \\ \; & \; & a_{N} & \cdots & \; & \cdots & a_{{Nx} + 1} \\ O & \; & \; & O & \; & \; & \; \end{bmatrix}}} & {{{\left. \begin{matrix} \; \\ \; \\ \; \\ \; \\ \; \\ \; \\ \; \end{matrix} \right\} 2N} - 1},} \end{matrix} & (10) \\ {{{\overset{\rightarrow}{A}}_{z} = {\left( {a_{1},a_{2},\cdots\mspace{11mu},a_{N},\overset{\overset{N_{f} - N}{︷}}{0,\cdots\mspace{11mu},0}} \right) \equiv \left( {\overset{\rightarrow}{A},\overset{\overset{N_{f} - N}{︷}}{0,\cdots\mspace{11mu},0}} \right)}},} & (11) \end{matrix}$ here a₁, . . . , a_(N) represent sampled values of the modulated pulse signal in order of range; a arbitrary constant of complex number; n, k positive integers from 1 to N_(f); N_(f) sampling number of a first Fourier transformation; Nx arbitrary sampling number less than N_(f); Q a fast Fourier Transformation; {circumflex over (Q)} a inverse fast Fourier transformation; symbol “*” complex conjugate; and symbol “T” transverse matrix, and wherein the coefficient calculator transmits the coefficient vector {right arrow over (H)}_(dz) to the pulse compression filter.
 8. The pulse compression processor according to claim 7, wherein the coefficient calculator comprises: a first Fourier transformation operator operating the fast Fourier transformation Q to the coefficient vector {right arrow over (H)}_(dz), resulting in generating a spectral coefficient vector Q{right arrow over (H)}_(dz) ^(T) in frequency space, and wherein the pulse compression filter comprises: a second Fourier transformation operator operating the fast Fourier transformation Q to the input vector {right arrow over (A)}, resulting in generating a spectral input vector Q{right arrow over (A)}^(T) in the frequency space; a multiply operator indirectly compressing the spectral input vector Q{right arrow over (A)}^(T) generated by the second Fourier transformation operator, based on the spectral coefficient vector Q{right arrow over (H)}_(dz) ^(T) generated by the first Fourier transformation operator, resulting in generating a spectral output vector Q{right arrow over (y)}_(mz) ^(T) in the frequency space; and an inverse Fourier transformation operator operating the inverse fast Fourier transformation {circumflex over (Q)} to the spectral output vector Q{right arrow over (y)}_(mz) ^(T) generated by the multiply operator, resulting in outputting a real output vector {right arrow over (y)}_(mz) in real space.
 9. The pulse compression processor according to claim 7, wherein the coefficient calculator operating the fast Fourier transformation Q to the coefficient vector {right arrow over (H)}_(dz), resulting in generating a spectral coefficient vector Q{right arrow over (H)}_(dz) ^(T) in frequency space, and wherein the pulse compression filter includes: a Fourier transforming operator operating the fast Fourier transformation operation Q to the input vector {right arrow over (A)}, resulting in generating a spectral input vector Q{right arrow over (A)}^(T) in the frequency space; a multiply operator indirectly compressing the spectral input signal Q{right arrow over (A)}^(T) generated by the Fourier transforming operator, based on the spectral coefficient vector Q{right arrow over (H)}_(dz) ^(T) generated by the coefficient calculator, resulting in generating a spectral output vector Q{right arrow over (y)}_(mz) ^(T) in the frequency space; and an inverse Fourier transformation operator operating the inverse fast Fourier transformation {circumflex over (Q)} to the spectral output vector Q{right arrow over (y)}_(mz) ^(T) generated by the multiply operator, resulting in outputting a real output vector {right arrow over (y)}_(mz) in real space. 